Type System Based Rational Lazy IDA
نویسندگان
چکیده
Meta-reasoning can improve numerous search algorithms, but necessitates collection of statistics to be used as probability distributions, and involves restrictive meta-reasoning assumptions. The recently suggested scheme of type systems in search algorithms is used in this paper for collecting these statistics. The statistics are then used to better estimate the unknown quantity of expected regret of computing a heuristic in Rational Lazy IDA* (RLIDA*), and also facilitate a second improvement due to relaxing one of the unrealistic meta-reasoning assumptions in RLIDA*.
منابع مشابه
Rational Deployment of Multiple Heuristics in IDA
Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms. This paper applies rational metareasoning to IDA* when several admissible heuristics are available. The obvious basic approach of taking the maximum of the heuristics is improved upon by lazy evaluation of the heuristics, resulting in a variant known as Lazy IDA*. We introduce a rationa...
متن کاملHigher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations
This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an extension and refinement of Prehofer’s higher-order narrowing calculus LN using the techniques developed in the refinement of a first-order lazy narrowing calculus LNC. HOLN is defined to deal with both unoriented and oriented equat...
متن کاملTowards Rational Deployment of Multiple Heuristics in A*
The obvious way to use several admissible heuristics in A∗ is to take their maximum. In this paper we aim to reduce the time spent on computing heuristics. We discuss Lazy A∗, a variant of A∗ where heuristics are evaluated lazily: only when they are essential to a decision to be made in the A∗ search process. We present a new rational meta-reasoning based scheme, rational lazy A∗, which decides...
متن کاملToward Rational Deployment of Multiple Heuristics in A
The obvious way to use several admissible heuristics in A∗ is to take their maximum. In this paper we aim to reduce the time spent on computing heuristics. We discuss Lazy A∗, a variant of A∗ where heuristics are evaluated lazily: only when they are essential to a decision to be made in the A∗ search process. We present a new rational meta-reasoning based scheme, rational lazy A∗, which decides...
متن کاملLazy attribute selection: Choosing attributes at classification time
Attribute selection is a data preprocessing step which aims at identifying relevant attributes for the target machine learning task – namely classification in this paper. In this paper, we propose a new attribute selection strategy – based on a lazy learning approach – which postpones the identification of relevant attributes until an instance is submitted for classification. Our strategy relie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015